On subgroups of free Burnside groups of large odd exponent
نویسندگان
چکیده
منابع مشابه
On Subgroups of Free Burnside Groups of Large Odd Exponent
We prove that every noncyclic subgroup of a free m-generator Burnside group B(m, n) of odd exponent n ≫ 1 contains a subgroup H isomorphic to a free Burnside group B(∞, n) of exponent n and countably infinite rank such that for every normal subgroup K of H the normal closure 〈K〉B(m,n) of K in B(m, n) meets H in K. This implies that every noncyclic subgroup of B(m, n) is SQ-universal in the clas...
متن کاملOn Finite and Locally Finite Subgroups of Free Burnside Groups of Large Even Exponents
The following basic results on infinite locally finite subgroups of a free m-generŽ . 48 ator Burnside group B m, n of even exponent n, where m ) 1 and n G 2 , n is divisible by 29, are obtained: A clear complete description of all infinite groups that Ž . Ž . are embeddable in B m, n as maximal locally finite subgroups is given. Any Ž . infinite locally finite subgroup L of B m, n is contained...
متن کاملOn the Burnside Problem for Groups of Even Exponent
The Burnside problem about periodic groups asks whether any finitely generated group with the law x ≡ 1 is necessarily finite. This is proven only for n ≤ 4 and n = 6. A negative solution to the Burnside problem for odd n ≫ 1 was given by Novikov and Adian. The article presents a discussion of a recent solution of the Burnside problem for even exponents n ≫ 1 and related results. 1991 Mathemati...
متن کاملHardness of Learning Problems over Burnside Groups of Exponent
In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. in [5, 6]. In particular, we study the Bn-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-redu...
متن کاملHardness of learning problems over Burnside groups of exponent 3
In this work we investigate the hardness of a computational problem introduced in the recent work of Baumslag et al. in [3, 4]. In particular, we study the Bn-LHN problem, which is a generalized version of the learning with errors (LWE) problem, instantiated with a particular family of non-abelian groups (free Burnside groups of exponent 3). In our main result, we demonstrate a random self-redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 2003
ISSN: 0019-2082
DOI: 10.1215/ijm/1258488155